Linear (q+1)-fold Blocking Sets in PG(2, q4)
نویسندگان
چکیده
منابع مشابه
Linear blocking sets in PG(2, q4)
In this paper, by using the geometric construction of linear blocking sets as projections of canonical subgeometries, we determine all the GF (q)linear blocking sets of the plane PG(2, q).
متن کاملThe characterisation of the smallest two fold blocking sets in PG(n, 2)
We classify the smallest two fold blocking sets with respect to the (n−k)-spaces in PG(n, 2). We show that they either consist of two disjoint k-dimensional subspaces or are equal to a (k+1)-dimensional space minus one point.
متن کاملLinear Point Sets and Rédei Type k-blocking Sets in PG(n, q)
In this paper, k-blocking sets in PG(n, q), being of Rédei type, are investigated. A standard method to construct Rédei type k-blocking sets in PG(n, q) is to construct a cone having as base a Rédei type k′-blocking set in a subspace of PG(n, q). But also other Rédei type k-blocking sets in PG(n, q), which are not cones, exist. We give in this article a condition on the parameters of a Rédei ty...
متن کاملA Q4/Q4 continuum structural topology optimization implementation
A node-based design variable implementation for continuum structural topology optimization in a finite element framework is presented and its properties are explored in the context of solving a number of different design examples. Since the implementation ensures Ccontinuity of design variables, it is immune to elementwise checkerboarding instabilities that are a concern with element-based desi...
متن کاملk-Fold Sidon Sets
Let k > 1 be an integer. A set A ⊂ Z is a k-fold Sidon set if A has only trivial solutions to each equation of the form c1x1 + c2x2 + c3x3 + c4x4 = 0 where 0 6 |ci| 6 k, and c1 + c2 + c3 + c4 = 0. We prove that for any integer k > 1, a k-fold Sidon set A ⊂ [N ] has at most (N/k)1/2 + O((Nk)1/4) elements. Indeed we prove that given any k positive integers c1 < · · · < ck, any set A ⊂ [N ] that c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2000
ISSN: 1071-5797
DOI: 10.1006/ffta.2000.0280